Strong chromatic index and Hadwiger number
نویسندگان
چکیده
We investigate the effect of a fixed forbidden clique minor upon strong chromatic index, both in multigraphs and simple graphs. conjecture for each k ? 4 that any K -minor-free multigraph maximum degree ? has index at most 3 2 ( ? ) ?. present construction certifying if true is asymptotically sharp as ? ?. In support conjecture, we show it case = prove statement number place index. By contrast, make basic observation graphs, problem edge-colouring “between” Hadwiger's Conjecture its fractional relaxation. For 5, also edge-diameter have 1
منابع مشابه
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs
A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly chordal graphs and interval graphs. We prove that Vizing's total-colour conjecture holds for dually chordal graphs. We describe a new heuristi...
متن کاملThe Strong Chromatic Index of Random Graphs
The strong chromatic index of a graph G, denoted by χs(G), is the minimum number of colors needed to color its edges so that each color class is an induced matching. In this paper we analyze the asymptotic behavior of this parameter in a random graph G(n, p), for two regions of the edge probability p = p(n). For the dense case, where p is a constant, 0 < p < 1, we prove that with high probabili...
متن کاملStrong Chromatic Index in Subset Graphs
The strong chromatic index of a graph G, denoted sq(G), is the minimum number of parts needed to partition the edges of G into induced matchings. For 0 5 k 5 1 5 m, the subset graph S,(k, 1) is a bipartite graph whose vertices are the kand 1-subsets of an m element ground set where two vertices are adjacent if and only if one subset is contained in the other. We show that sq(Sm(k, 1 ) ) = (&) a...
متن کاملOn Strong Chromatic Index of Halin Graph
A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at a common vertex, or being adjacent to the same edge of G, are assigned different colors. The strong chromatic index of G is the smallest number k for which G has a strong k-edge-coloring. A Halin graph is a planar graph consisting of a tree with no vertex of degree tw...
متن کاملStrong Chromatic Index of Products of Graphs
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges in such a way that each colour class is an induced matching. In this paper, we present bounds for the strong chromatic index of three different products of graphs in terms of the strong chromatic index of each factor. For the Cartesian product of paths, cycles or complete graphs, we derive sharper ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2021
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22788